Speed-up Techniques in Matrix Computation: a Case Study
نویسندگان
چکیده
Improvements on the execution performance of a given application can be obtained simply by the use of more efficient algorithms, a better codification and by the selection of adequate compiling options. The present study aims to analyse these different scopes, and to apply this methodology to square matrix multiplication. The case study uses C language, the GCC compiler, and a reference algorithm taken from the BLAS library. This study also aims comment the impact the codification and compiling techniques have on the whole process.
منابع مشابه
Drawing Graphs to Speed Up Shortest-Path Computations
We consider the problem of (repeatedly) computing singlesource single-target shortest paths in large, sparse graphs. Previous investigations have shown the practical usefulness of geometric speed-up techniques that guarantee the correctness of the result for shortest-path computations. However, such speed-up techniques utilize a layout of the graph which typically comes from geographic informat...
متن کاملFast Finite Element Method Using Multi-Step Mesh Process
This paper introduces a new method for accelerating current sluggish FEM and improving memory demand in FEM problems with high node resolution or bulky structures. Like most of the numerical methods, FEM results to a matrix equation which normally has huge dimension. Breaking the main matrix equation into several smaller size matrices, the solving procedure can be accelerated. For implementing ...
متن کاملParallel Construction of Bounding Volumes
This paper presents techniques for speeding up commonly used algorithms for bounding volume construction using Intel’s SIMD SSE instructions. A case study is presented, which shows that speed-ups between 7–9 can be reached in the computation of k-DOPs. For the computation of tight fitting spheres, a speed-up factor of approximately 4 is obtained. In addition, it is shown how multi-core CPUs can...
متن کاملEfficient Techniques for High-Speed Elliptic Curve Cryptography
In this paper, a thorough bottom-up optimization process (field, point and scalar arithmetic) is used to speed up the computation of elliptic curve point multiplication and report new speed records on modern x86-64 based processors. Our different implementations include elliptic curves using Jacobian coordinates, extended Twisted Edwards coordinates and the recently proposed Galbraith-Lin-Scott...
متن کاملDesign of An Intelligent Model for Strategic Planning in Mineral Holding: Case study, Shahab-Sang Holding
Business logic is one of the most important logics based on the decision matrix. However, using this logic alone and environmental uncertainty leads to problems such as low accuracy and integrity in strategic planning. In this work, we use an intelligent model based on the neural-fuzzy approach aiming at a desired decision-making and reducing the uncertainty in the strategic planning in mineral...
متن کامل